Query Processing in OODB
نویسندگان
چکیده
In obiect-oriented databases, relationships are generally maintained explicitly. The partial result of a retrieved object can be used to efficiently retrieve related objects. Instead of optimizing joins as in relational database systems, pointer chasing is optimized in object-oriented database systems. Further, semantics inherent in the object-oriented database, like superclass-subclass relationships and composite-component relationships between object classes, must be realised. In this paper, we describe our initial result in query optimization in an object-oriented database system. Semantic qu;;; transformation is used to preprocess the query. semantically optimized query is then translated into a query evaluation plan which comprises method invocations that can be evaluated directly by the system. In the process of query evaluation plan generation, initial results tend to show that a one source query plan is almost optimal. A prototype based on this design has been completed and some results from a simulation study on this prototype are also reported in this paper.
منابع مشابه
A Study on Development of a Deductive Object-Oriented Database and Its Application to Genome Analysis
A deductive object-oriented database (DOOD) is the integration of a deductive database (DDB) and an object-oriented database (OODB). DDB and OODB are next generation databases proposed for overcoming the shortcomings of relational databases (RDB). The DDB is an extension of the RDB. It is based on the rst order predicate logic, and provides a declarative query (and programming) language. An adv...
متن کاملA Partitioning strategy for OODB
An effective strategy for distributing data across multiple disks is crucial to achieving good performance in a parallel objectoriented database management system. During query processing, a large amount of data need to be processed and transferred among the processing nodes in the system. A good data placement strategy should be able to reduce the communication overheads, and, at the same time...
متن کاملIncremental Maintenance of Materialized Path Query OODB
Materialized database views allow applications to beneet from the powerful exibility of views while minimizing the performance penalties traditionally associated with views. However, the need to maintain materialized views in the face of updates limits the variety of queries that can be used to deene them. In this paper we address the problem of incrementally maintaining OODB views formed using...
متن کاملParallel Sub-collection Join Query Algorithms for a High Performance Object-Oriented Database Architecture
One of the differences between relational and object-oriented databases (OODB) is attributes in OODB can be of a collection type (e.g. sets, lists, arrays, bags) as well as a simple type (e.g. integer, string). Consequently, explicit join queries in OODB may be based on collection attributes. One form of collection join queries in OODB is sub-collection join queries, where the joins are based o...
متن کاملParallel Collection Equi-Join Algorithms for Object-Oriented Databases
One of the differences between relational and objectoriented databases (OODB) is that attributes in OODB can be of a collection type (e.g. sets, lists, arrays, bags) as well as a simple type (e.g. integer, string). Consequently, explicit join queries in OODB may be based on collection attributes. One form of collection join queries in OODB is “collection-equi join queries”, where the joins are ...
متن کاملOptimizing Object-Oriented Collection Join Queries through Path Traversals
Path traversals have been recognized as one of the strengths of object-oriented query processing as object retrieval can be carried out through pointer navigation. Apart from path traversals, explicit join between objects is sometimes necessary in Object-Oriented Databases (OODB), due to the absence of pointer connections or the need for value matching between objects. Like in Relational Databa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991